A Dynamic-Routing Algorithm Based on a Virtual Quantum Key Distribution Network

Quantum key distribution (QKD) is an encrypted communication technique based on the principles of quantum mechanics that ensures security by exploiting properties states. Currently, transmission efficiency QKD system low. Trusted relay technology used to solve this problem and achieve long-distance transmission. However, trusted relaying alone cannot decrypt issues poor link stability low utilization resources. To further optimize performance, we propose a dynamic routing algorithm. One improvement schemes includes following: firstly, adjustable-size pool (QKP) designed, which can dynamically adjust size refreshing according actual demand. Secondly, resources improved using residual model obtain remaining amount in QKP set threshold. We calculate link-blocking probability track blocking intensity entry combining Poisson process, thus realizing evaluation stability. Finally, number keys combine with random wandering as basis route selection for algorithm efficient path selection. validated comparing it other algorithms Mininet simulation platform, proved have better performance terms congestion avoidance, delay reduction, efficiency. This scheme provides novel way problems existing systems. It effectively improves strengthens system’s obtaining critical volume, accurately evaluating state, selecting optimal path.